Ellipse Detection and Matching with Uncertainty
نویسندگان
چکیده
This paper considers the fitting of ellipses to edge-based pixel data in digital images. It infers the ellipses as projected circles, viewed obliquely, and uses this information to constrain the position, viewpoint and scale of model objects projected onto the image. A central theme of the work is the explicit use of uncertainty, which reflects observation errors in the image data, and which is propagated through the model matching stages, providing a consistent and robust representation of errors.
منابع مشابه
A generalized method for 3D object location from single 2D images
-A method is presented to solve for the three-dimensional (3D) object position and orientation from single two-dimensional (2D) images based on a systematic hierarchy of features: primitive features, generalized features, and compound structures. A virtual viewpoint analysis shows that a featurecentered coordinate system allows us to drastically reduce the mathematical complexity of the inverse...
متن کاملA Semi-Analytical Method for History Matching and Improving Geological Models of Layered Reservoirs: CGM Analytical Method
History matching is used to constrain flow simulations and reduce uncertainty in forecasts. In this work, we revisited some fundamental engineering tools for predicting waterflooding behavior to better understand the flaws in our simulation and thus find some models which are more accurate with better matching. The Craig-Geffen-Morse (CGM) analytical method was used to predict recovery performa...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملEllipse Detection through Decomposition of Circular Arcs and Line Segments
In this work we propose an efficient and original method for ellipse detection which relies on a recent contour representation based on arcs and line segments [1]. The first step of such a detection is to locate ellipse candidate with a grouping process exploiting geometric properties of adjacent arcs and lines. Then, for each ellipse candidate we extract a compact and significant representatio...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کامل